منابع مشابه
Scheduling Dyadic Intervals
We consider the problem of computing the shortest schedule of the intervals [j2-‘, (j + 1)2-‘), for 0 < j < 2’ 1 and 1 < i < k such that separation of intersecting intervals is at least R. This problem arises in an application of wavelets to medical imaging. It is a generalization of the graph separation problem for the intersection graph of the intervals, which is to assign the numbers 1 to Zk...
متن کاملOnline Scheduling Intervals and t-Intervals
A t-interval is a union of at most t half-open intervals on the real line. The special case where t = 1 is an interval. Often, the requests for contiguous allocation of a linear resource can be modeled by a sequence of t-intervals. We consider the problems of online scheduling intervals and t-intervals, which show up in Video-on-Demand services, high speed networks and molecular biology, among ...
متن کاملJobshop Scheduling with task intervals
This paper presents a technique for scheduling based on sets of tasks. Used within a branch & bound algorithm, it cuts branches very eeciently. It is thus well adapted for proofs of optimality. This technique solves typical hard 10 10 problems within a few thousand backtracks and is also adapted to large problems. LA21, a 15 10 problem open since 1984 is solved and a new bound is given for LA29...
متن کاملCumulative Scheduling with Task Intervals
This paper presents a set of propagation rules to solve cumulative constraints. As in our previous paper on jobshop scheduling [8], our goal is to propose to the CLP community techniques that allow a constraint satisfaction program to obtain performances which are competitive with ad-hoc approaches. The rules that we propose are a mix of an extension of the concept of task intervals to the cumu...
متن کاملImproved CLP Scheduling with Task Intervals
In this paper we present a new technique that can be used to improve performance of job scheduling with a constraint programming language. We show how, by focusing on some special sets of tasks, one can bring CLP in the same range of efficiency as traditional OR algorithms on a classical benchmark (MT10 [MT63]), thus making CLP both a flexible and an efficient technique for such combinatorial p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00068-o